On planar intersection graphs with forbidden subgraphs
نویسندگان
چکیده
منابع مشابه
On planar intersection graphs with forbidden subgraphs
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has at most n times a polylogarithmic number of edges, where the exponent of the logarithmic factor depends on k. In the case where C consists of convex sets, we improve this bound to O(n log n). If in addition k = 2, the ...
متن کاملGraphs with Forbidden Subgraphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...
متن کاملUniversal Graphs (with Forbidden Subgraphs)
The graph theoretic problem of identifying the finite sets C of constraint graphs for which there is a countable universal C-free graph is closely related to the problem of determining for which sets C the model companion T ∗ C of the theory of C-free graphs is א0-categorical, and this leads back to combinatorics. Little is known about these theories from any other perspective, such as stabilit...
متن کاملForbidden Subgraphs for Planar Blict and Blitact Graphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraphs they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. Such subgraphs are called forbidden subgraphs. In this paper, we present characterizations of graphs whose blict and bl...
متن کاملDegree Powers in Graphs with Forbidden Subgraphs
For every real p > 0 and simple graph G, set f (p,G) = ∑ u∈V (G) d (u) , and let φ (r, p, n) be the maximum of f (p,G) taken over all Kr+1-free graphs G of order n. We prove that, if 0 < p < r, then φ (r, p, n) = f (p, Tr (n)) , where Tr (n) is the r-partite Turan graph of order n. For every p ≥ r + ⌈√ 2r ⌉ and n large, we show that φ (p, n, r) > (1 + ε) f (p, Tr (n)) for some ε = ε (r) > 0. Ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2008
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.20332